Functional Dependencies with null Markers

نویسندگان

  • Antonio Badia
  • Daniel Lemire
چکیده

Functional dependencies are an integral part of database design. However, they are only defined when we exclude null markers. Yet we commonly use null markers in practice. To bridge this gap between theory and practice, researchers have proposed definitions of functional dependencies over relations with null markers. Though sound, these definitions lack some qualities that we find desirable. For example, some fail to satisfy Armstrong’s axioms—while these axioms are part of the foundation of common database methodologies. We propose a set of properties that any extension of functional dependencies over relations with null markers should possess. We then propose two new extensions having these properties. These extensions attempt to allow null markers where they make sense to practitioners. They both support Armstrong’s axioms and provide realizable null markers: at any time, some or all of the null markers can be replaced by actual values without causing an anomaly. Our proposals may improve database designs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Strong keys and functional dependencies in partial database relations

We study keys and functional dependencies in the context of partial relations that permit null values with the interpretation no information. Based on Codd’s principle of entity integrity we propose the class of strong keys over partial database relations. These keys enforce both uniqueness and totality of tuples. We study the interaction of strong keys with Lien, Atzeni and Morfuni’s classes o...

متن کامل

Null Inclusion Dependencies in Relational Databases

Functional dependencies (FDs) and inclusion dependencies (INDs) are the most fundamental integrity constraints that arise in practice in relational databases. We introduce null inclusion dependencies (NINDs) to cater for the situation when a database is incomplete and contains null values. We show that the implication problem for NINDs is the same as that for INDs. We then present a sound and c...

متن کامل

The Additivity Problem for Data

Functional dependencies (FDs) and inclusion dependencies (INDs) are the most fundamental integrity constraints that arise in practice in relational databases. We introduce null functional dependencies (NFDs) and null inclusion dependencies (NINDs) to cater for the situation when a database is incomplete and thus contains null values. If a NFD or NIND is weakly satissed in a database, then there...

متن کامل

Mining Full Functional Dependency to Answer Null Queries and Reduce Imprecise Information Based on Fuzzy Object Oriented Databases

Discovery of Full functional dependencies from relations has been identified as an important database analysis technique. In order to deal with information inexactness, fuzzy techniques have extensively been integrated with different database models and theories. However, the information is often vague or ambiguous and very difficult to represent in implementing the application software. This p...

متن کامل

Functional Dependencies and Incomplete Information

Functional dependencies play an important role in relational database design. They are defined in the context of a single relation which a t all times must contain tuples with non-null entries. In this paper we examine an extension of the functional dependency interpretation t o handle null values, that is, entries in tuples that represent incomplete information in a relational database. A comp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Comput. J.

دوره 58  شماره 

صفحات  -

تاریخ انتشار 2015